A self-adaptive inertial algorithm for solving split null point problems and common fixed point problems
نویسندگان
چکیده
منابع مشابه
A strong convergence theorem for solutions of zero point problems and fixed point problems
Zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. A strong convergence theorem for the common solutions of the problems is established in the framework of Hilbert spaces.
متن کاملMultidirectional hybrid algorithm for the split common fixed point problem and application to the split common null point problem
In this article, a new multidirectional monotone hybrid iteration algorithm for finding a solution to the split common fixed point problem is presented for two countable families of quasi-nonexpansive mappings in Banach spaces. Strong convergence theorems are proved. The application of the result is to consider the split common null point problem of maximal monotone operators in Banach spaces. ...
متن کاملStrong Convergence Algorithm for Split Equilibrium Problems and Hierarchical Fixed Point Problems
The purpose of this paper is to investigate the problem of finding the approximate element of the common set of solutions of a split equilibrium problem and a hierarchical fixed point problem in a real Hilbert space. We establish the strong convergence of the proposed method under some mild conditions. Several special cases are also discussed. Our main result extends and improves some well-know...
متن کاملa strong convergence theorem for solutions of zero point problems and fixed point problems
zero point problems of the sum of two monotone mappings and fixed point problems of a strictly pseudocontractive mapping are investigated. a strong convergence theorem for the common solutions of the problems is established in the framework of hilbert spaces.
متن کاملCircumscribed ellipsoid algorithm for fixed-point problems
We present a new implementation of the almost optimal Circumscribed Ellipsoid (CE) Algorithm for approximating fixed points of nonexpanding functions, as well as of functions that may be globally expanding, however, are nonexpanding/contracting in the direction of fixed points. Our algorithm is based only on function values, i.e., it does not require computing derivatives of any order. We utili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied set-valued analysis and optimization
سال: 2023
ISSN: ['2562-7775', '2562-7783']
DOI: https://doi.org/10.23952/asvao.5.2023.1.04